منابع مشابه
A remark on hereditarily nonparadoxical sets
Call a set A ⊆ R paradoxical if there are disjoint A0, A1 ⊆ A such that both A0 and A1 are equidecomposable with A via countabbly many translations. X ⊆ R is hereditarily nonparadoxical if no uncountable subset of X is paradoxical. Penconek raised the question if every hereditarily nonparadoxical set X ⊆ R is the union of countably many sets, each omitting nontrivial solutions of x − y = z − t....
متن کاملThe Hereditarily Finite Sets
The theory of hereditarily finite sets is formalised, following the development of Świerczkowski [2]. An HF set is a finite collection of other HF sets; they enjoy an induction principle and satisfy all the axioms of ZF set theory apart from the axiom of infinity, which is negated. All constructions that are possible in ZF set theory (Cartesian products, disjoint sums, natural numbers, function...
متن کاملOn hereditarily small sets in ZF
We show in ZF (the usual set theory without Choice) that for any set X, the collection of sets Y such that each element of the transitive closure of {Y } is strictly smaller in size than X (the collection of sets hereditarily smaller than X) is a set. This result has been shown by Jech in the case X = ω1 (where the collection under consideration is the set of hereditarily countable sets). In [2...
متن کاملHereditarily Finite Sets in Constructive Type Theory
We axiomatize hereditarily finite sets in constructive type theory and show that all models of the axiomatization are isomorphic. The axiomatization takes the empty set and adjunction as primitives and comes with a strong induction principle. Based on the axiomatization, we construct the set operations of ZF and develop the basic theory of finite ordinals and cardinality. We construct a model o...
متن کاملA Formalisation of Finite Automata Using Hereditarily Finite Sets
Hereditarily finite (HF) set theory provides a standard universe of sets, but with no infinite sets. Its utility is demonstrated through a formalisation of the theory of regular languages and finite automata, including the Myhill-Nerode theorem and Brzozowski’s minimisation algorithm. The states of an automaton are HF sets, possibly constructed by product, sum, powerset and similar operations.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Topology and its Applications
سال: 2014
ISSN: 0166-8641
DOI: 10.1016/j.topol.2013.10.036